| 翻訳と辞書 |
| Unordered associative containers (C++) ： ウィキペディア英語版 |
Unordered associative containers (C++)
In the C++ programming language, unordered associative containers are a group of class templates in the C++ Standard Library that implement variations of hash tables. Being templates, they can be used to store arbitrary elements, such as integers or custom classes. The following containers are defined in the current revision of the C++ standard: unordered_set, unordered_map, unordered_multiset, unordered_multimap. Each of these containers differ only on constraints placed on their elements.
The unordered associative containers are similar to the associative containers in C++ standard library but have different constraints. As their name implies, the elements in the unordered associative containers are not ordered. This is due to the use of hashing to store objects. The containers can still be iterated through like a regular associative container.
==History==
The first widely used implementation of hash tables in the C++ language was hash_map, hash_set, hash_multimap, hash_multiset class templates of the SGI STL.〔(【引用サイトリンク】title=hash_map )〕 Due to their usefulness, they were later included in several other implementations of the C++ standard library (e.g., the GCC's libstdc++〔(【引用サイトリンク】title=libstdc++: hash_map Class Template Reference )〕 and the MSVC standard library).
The hash_
* class templates were proposed into C++ TR1 and were accepted under names unordered_
*. Later, they were incorporated into the C++11 revision of the C++ standard. An implementation is also available in the Boost C++ Libraries as
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Unordered associative containers (C++)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|